Background and aim: Recently, the use of data science techniques in healthcare has been increased remarkably. Community detection as one the important methods of data science is utilized in the health domain. Methods: This paper detects disease areas based on combination of big data and graph mining methods on drug prescriptions. At first, network of prescription is designed, and Louvain Algorithm is applied for community detection of 50000 Iranian prescriptions in 2014 gathered from the Iranian Health Insurance Organization. We use modularity metric for validation of the results and the experts’ opinion as the external validation of communities. Results: The outputs are consist of six communities. These communities are labeled based on experts’ opinion that present the disease fields. Conclusion: The Louvain Algorithm has the ability to detect the major communities of the prescription database with an acceptable accuracy. We have proven that these communities present the disease fields.

Background and Objectives: Louvain is a time-consuming community detection Algorithm especially in large-scale networks. Using Graphic Processing Unit (GPU) in order to calculate modularity sigma, which is a major processing section in Louvain Algorithm, can reduce Algorithm execution time and make it practical for large-scale networks. Methods: The proposed Algorithm Dynamic CUDA Louvain Method (DCLM) blocks hardware threads dynamically on cores inside GPU. By considering the properties of GPU, this Algorithm allocates the maximal number of processing cores to each Stream Multi-Processor (SM) as number of threads in a block. If the number of nodes in the graph is smaller than all physical cores on GPU, number of threads per block Is equal to the ratio number of graph nodes over the number of SMs. Results: The implementation results demonstrated that the proposed Algorithm is able to decrease the run time by 15% in comparison with the best past method in the large-scale graph. Conclusion: We have introduced DCLM Algorithm based on GPU that accelerates Louvain community detection Algorithm. Dynamic allocation of threads to each block has a significant effect on the reduction of Algorithm execution time. However, incrementing the number of threads per block alone does not result to acceleration the speed of calculations.

This study focuses on the investigation of intelligent form-finding and vibration analysis of a triangular polyhedral tensegrity that is enclosed within a sphere and subjected to external loads. The nonlinear dynamic equations of the system are derived using the Lagrangian approach and the finite element method. The proposed form-finding approach, which is based on a basic genetic Algorithm, can determine regular or irregular tensegrity shapes without dimensional constraints. Stable tensegrity structures are generated from random configurations and based on defined constraints (nodes located on the sphere, parallelism, and area of upper and lower surfaces), and shape finding is performed using the fitness function of the genetic Algorithm and multi-objective optimization goals. The genetic Algorithm's efficacy in determining the shape of structures with unpredictable configurations is evaluated in two distinct scenarios: one involving a known connection matrix and the other involving fixed or random member positions (struts and cables). The shapes obtained from the Algorithm suggested in this study are validated using the force density approach, and their vibration characteristics are examined. The findings of the comparative study demonstrate the efficacy of the proposed methodology in determining the vibrational behavior of tensegrity structures through the utilization of intelligent shape seeking techniques.

Increasing population and food demand, disproportionate cultivation and annual production of various agricultural products with market needs and low productivity of the agricultural sector and the loss of water and soil resources have made it necessary to determine and implement the country's optimal cropping pattern. In this study, due to the limitations and problems of classical methods in order to reduce processing time and improve the quality of solutions, the Multi-Objective Chaotic Particle Swarm Optimization was used to determine the optimal cultivation pattern of Sistan plain in optimal conditions and deficit irrigation. The results of the Multi-Objective Chaotic Particle Swarm Optimization for the dominant cultures in the region showed that the current cropping pattern of the region is not optimal and with the implementation of the proposed model, the profit per unit area under cultivation will increase. The results of application of deficit irrigation during different growing periods of wheat, barley, alfalfa, sorghum, watermelon and grapes showed that applying deficit irrigation in this plain is not a good strategy and therefore only a full irrigation strategy is recommended. The results of sensitivity analysis of the model showed that at low prices, farmers reaction is less and at higher prices more reaction to price changes and with increasing prices, the program efficiency is lower.

One of the basic topics in hydrological and river engineering studies is flood routing.Flood flooding is common in multi-tributary rivers and rivers without intermediate basin statistics. Therefore, to achieve the determination of slopes and cross-sections in all sections of the river, the Muskingum hydrological model is a useful method that helps to save information on the depth and flow of the flood at any time by saving time and money. To specify. In this study, the nonlinear parameters of the new Muskingum model are optimized based on the fly Algorithm (MA). In this non-linear model of Muskingum, which has eight parameters, the recovery coefficient γ is used, which has more or less values ​​than the number of peaks discharged in the output hydrograph.To evaluate the performance of Muskingum's new nonlinear model with the new MA Algorithm, the Wilson and Weisman-Lewis case study has been used by many previous researchers for validation.The results of the MA Algorithm for Wilson and Weissman-Lewis rivers show the minimization of the residual squares (SSQ) as the objective function, which is 3.21 for the Wilson River and 68722 for the Weissman River. The results of this study showed that the proposed model has high accuracy in estimating the output discharge values.

In recent years, the number of users of social networks has grown significantly. The big challenge for these networks’,audience is How to communicate with the people present on these networks. Friend recommender systems try to fix this challenge by offering suggestions. In this study, data from the social and scientific network of Kousarent were used. In this research, using 10 types of relationships between users without considering the friendship relationships, network graph created, and then by using 3 Algorithms Louvain, Kmeans and Hierarchical graph clustering was performed to identify communities. Clusters obtained from Louvain's clustering Algorithm had higher percentages of matching with friendships. Then, weights were calculated by genetic Algorithm for each of 10 relationships and by applying Louvain clustering Algorithm on the network graph, the highest percentage of matching with the optimal weight of each of the 10 relationships was obtained. In this case, the resulting clusters are optimal clusters containing the most similar users. So other users in the same cluster can be suggested as friends. The weight of the edges between the individuals in the graph was also used to prioritize the bids. At the end, the friend proposed method was evaluated and the percentage of suggested friends matched with the individual's true friends was calculated.

This article investigates the problem of simultaneous attitude and vibration control of a flexible spacecraft to perform high precision attitude maneuvers and reduce vibrations caused by the flexible panel excitations in the presence of external disturbances, system uncertainties, and actuator faults. Adaptive integral sliding mode control is used in conjunction with an attitude actuator fault iterative learning observer (based on sliding mode) to develop an active fault tolerant Algorithm considering rigid-flexible body dynamic interactions. The discontinuous structure of fault-tolerant control led to discontinuous commands in the control signal, resulting in chattering. This issue was resolved by introducing an adaptive rule for the sliding surface. Furthermore, the utilization of the sign function in the iterative learning observer for estimating actuator faults has not only enhanced its robustness to external disturbances through a straightforward design, but has also led to a decrease in computing workload. The strain rate feedback control Algorithm has been employed with the use of piezoelectric sensor/actuator patches to minimize residual vibrations caused by rigid-flexible body dynamic interactions and the effect of attitude actuator faults. Lyapunov's law ensures finite-time overall system stability even with fully coupled rigid-flexible nonlinear dynamics. Numerical simulations demonstrate the performance and advantages of the proposed system compared to other conventional approaches.